Compressed cliques graphs, clique coverings and positive zero forcing
نویسندگان
چکیده
منابع مشابه
Clique coverings and partitions of line graphs
A clique in a graph G is a complete subgraph of G. A clique covering (partition) of G is a collection C of cliques such that each edge of G occurs in at least (exactly) one clique in C. The clique covering (partition) number cc(G) (cp(G)) of G is the minimum size of a clique covering (partition) of G. This paper gives alternative proofs, using a unified approach, for the results on the clique c...
متن کاملOn self-clique graphs with triangular cliques
Abstract. A graph is an {r, s}-graph if the set of degrees of their vertices is {r, s}. A clique of a graph is a maximal complete subgraph. The clique graph K(G) of a graph G is the intersection graph of all its cliques. A graph G is self-clique if G is isomorphic to K(G). We show the existence of self-clique {5, 6}-graphs whose cliques are all triangles, thus solving a problem posed by Chia an...
متن کاملExtremal clique coverings of complementary graphs
Let G be a graph on n vertices and let G be its complement in K,,, the complete graph on n vertices . If f is a real valued function defined on graphs, what are the extreme values of f (G) +f (G) and f (G) f (G)? E. A. Nordhaus and J . W. Gaddum (see e .g . [5]) considered those questions when the function is the chromatic number . D . Taylor, R. D . Dutton and R. C. Brigham [5] studied the que...
متن کاملGeneralized clique coverings of chordal graphs
Two main types 1)£ clique coveri cd phs ha'J(? d j,scussed. One is ali que c C) v p r i r, 9 Cl f \! l-''', ice S , a set ,-, f clIques which between them contain eve! 'JI? te:,c at once. The other, a clique c:-overing of edgEs, is a set f cliques which between them contain eVPIY e0ge. CllVering of edges may be deflned as a lique covering of vertices with the added rest iction hat tho=> I:'"nds...
متن کاملOn the zero forcing number of some Cayley graphs
Let Γa be a graph whose each vertex is colored either white or black. If u is a black vertex of Γ such that exactly one neighbor v of u is white, then u changes the color of v to black. A zero forcing set for a Γ graph is a subset of vertices Zsubseteq V(Γ) such that if initially the vertices in Z are colored black and the remaining vertices are colored white, then Z changes the col...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2018
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2017.08.018